package E2016;

import java.util.Arrays;
public class Exam3_3 {
    public static void main(String[] args) {
        int[] a = new int[10];
        int count = 0;
        for (int i = 0;i>=0;i++) {
            if (i % 2 == 1 && i % 7 == 0 && i % 5 == 4 && i % 6 == 5 && i % 3 == 2) {
                a[count] = i;
                if (count==9){
                    break;
                }
                count++;

            }
        }
        Arrays.sort(a);
        System.out.println("台阶数最小为：" + a[0]);
    }
}
